Computation of Delta sets of numerical monoids
نویسندگان
چکیده
منابع مشابه
Shifts of generators and delta sets of numerical monoids
Let S be a numerical monoid with minimal generating set 〈n1, . . . , nt〉. For m ∈ S, if m = Pt i=1 xini, then Pt i=1 xi is called a factorization length of m. We denote by L(m) = {m1, . . . , mk} (where mi < mi+1 for each 1 ≤ i < k) the set of all possible factorization lengths of m. The Delta set of m is defined by ∆(m) = {mi+1 − mi | 1 ≤ i < k } and the Delta set of S by ∆(S) = ∪m∈S∆(m). In t...
متن کاملDelta Sets of Numerical Monoids Are Eventually Periodic
Let M be a numerical monoid (i.e., an additive submonoid of N0) with minimal generating set 〈n1, . . . , nt〉. For m ∈ M , if m = Pt i=1 xini, then Pt i=1 xi is called a factorization length of m. We denote by L(m) = {m1, . . . , mk} (where mi < mi+1 for each 1 ≤ i < k) the set of all possible factorization lengths of m. The Delta set of m is defined by ∆(m) = {mi+1 −mi | 1 ≤ i < k } and the Del...
متن کاملDelta Sets of Numerical Monoids Using Non-minimal Sets of Generators
Several recent papers have studied the structure of the delta set of a numerical monoid. We continue this work with the assumption that the generating set S chosen for the numerical monoid M is not necessarily minimal. We show that for certain choices of S, the resulting delta set can be made (in terms of cardinality) arbitrarily large or small. We close with a close analysis of the case where ...
متن کاملSet-oriented Numerical Computation of Rotation Sets
We establish a set-oriented algorithm for the numerical approximation of the rotation set of homeomorphisms of the two-torus homotopic to the identity. A theoretical background is given by the concept of ε-rotation sets. These are obtained by replacing orbits with ε-pseudo-orbits in the definition of the Misiurewicz-Ziemian rotation set and are shown to converge to the latter as ε decreases to ...
متن کاملNotions of Computation as Monoids
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level of abstraction one can obtain useful results which can be instantiated to the different notions of computation. In particular, we show how free constructions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2015
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-015-0785-9